Finding Optimal Flows Efficiently
نویسندگان
چکیده
Among the models of quantum computation, the One-way Quantum Computer [10, 11] is one of the most promising proposals of physical realization [12], and opens new perspectives for parallelization by taking advantage of quantum entanglement [2]. Since a one-way quantum computation is based on quantum measurement, which is a fundamentally nondeterministic evolution, a sufficient condition of global determinism has been introduced in [4] as the existence of a causal flow in a graph that underlies the computation. A O(n)-algorithm has been introduced [6] for finding such a causal flow when the numbers of output and input vertices in the graph are equal, otherwise no polynomial time algorithm was known for deciding whether a graph has a causal flow or not. Our main contribution is to introduce a O(n)-algorithm for finding a causal flow, if any, whatever the numbers of input and output vertices are. This answers the open question stated by Danos and Kashefi [4] and by de Beaudrap [6]. Moreover, we prove that our algorithm produces an optimal flow (flow of minimal depth.) Whereas the existence of a causal flow is a sufficient condition for determinism, it is not a necessary condition. A weaker version of the causal flow, called gflow (generalized flow) has been introduced in [3] and has been proved to be a necessary and sufficient condition for a family of deterministic computations. Moreover the depth of the quantum computation is upper bounded by the depth of the gflow. However, the existence of a polynomial time algorithm that finds a gflow has been stated as an open question in [3]. In this paper we answer this positively with a polynomial time algorithm that outputs an optimal gflow of a given graph and thus finds an optimal correction strategy to the nondeterministic evolution due to measurements.
منابع مشابه
A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem
The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...
متن کاملA case study of flood dynamic wave simulation in natural waterways using numerical solution of unsteady flows
Flood routing has many applications in engineering projects and helps designers in understanding the flood flow characteristics in river flows. Floods are taken unsteady flows that vary by time and location. Equations governing unsteady flows in waterways are continuity and momentum equations which in case of one-dimensional flow the Saint-Venant hypothesis is considered. Dynamic wave model as ...
متن کاملActive Control of Turbulent Channel Flows Based on Large Eddy Simulation
Advances in high-performance computing and Large-Eddy Simulation (LES) have made it possible to obtain accurate solutions of complex, turbulent flows at moderate Reynolds numbers. With these advances, computational modeling of turbulent flows in order to develop, evaluate, and optimize active control strategies is feasible. In this paper, we present approaches to numerical modeling of oppositio...
متن کاملO ( √ log n ) Approximation to Sparsest Cut in Õ ( n 2 ) Time
We show how to compute O( √ logn)-approximations to Sparsest Cut and Balanced Separator problems in Õ(n) time, thus improving upon the recent algorithm of Arora, Rao and Vazirani (2004). Their algorithm uses semidefinite programming and required Õ(n) time. Our algorithm relies on efficiently finding expander flows in the graph and does not solve semidefinite programs. The existence of expander ...
متن کاملFast, Fair, and Efficient Flows in Networks
We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, an optimal flow and an equilibrium flow share a desirable property in this situation: All flow-carrying paths have the same length, i.e., these solutions are “fair,” which i...
متن کامل